Planarity in ROMDD's of Multiple-Valued Symmetric Functions
نویسندگان
چکیده
We show that a multiple-valued symmetric function has a planar ROMDD (reduced ordered multiple-valued decisio n diagram) if and only if it is a pseudo-voting function. We show that the number of such functions is where r is the number of logic values and n is the number of variables. I t follows from this that the fraction of symmetric multiple-valued functions that have planar ROMDD's approaches 0 as n approaches infinity. Further, we show that the worst case and average number of nodes in planar ROMDD's of symmetri c functions is and , respectively, when n
منابع مشابه
Fuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملPlanar Multiple-Valued Decision Diagrams
In VLSI, crossings occupy space and cause delay. Therefore, there is significant benefit to planar circuits. We propose the use of planar multiple-valued decision diagrams to produce planar multiple-valued circuits. Specifically, we show conditions on 1) threshold functions, 2 symmetric functions, and 3) monodiagrams. Our results apply to binary functions, as well. For example, we show that all...
متن کاملWorst Case Number of Terms in Symmetric Multiple-Valued Functions
A symmetric multiple-valued function can be realized as the disjunction of fwrdamental symmetric functions. A simpler disjunction can be formed when the latter functions combine in the same way that minterms combine to form simpler product terms for sum-of-products expressions. We solve a problem posed by Muzio [7], who seeks the worst case symmetric function in the sense that the maximum numbe...
متن کاملAverage and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions
We derive the average and worst case number of nodes in decision diagrams of r-valued symmetric functions of n variables. We show that, for large n, both numbers approach n r r ! . For binary decision diagrams (r = 2 ), we compute the distribution of the number of functions on n variables with a specified number of nodes. Subclasses of symmetric functions appear as features in this distribution...
متن کاملAverage an Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions
We derive the average and worst case number of nodes in decision diagrams of r-valued symmetric functions of n variables. We show that, for large n, both numbers approach n r r ! . For binary decision diagrams (r = 2 ), we compute the distribution of the number of functions on n variables with a specified number of nodes. Subclasses of symmetric functions appear as features in this distribution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996